From Term Rewriting to Generalised Interaction Nets
نویسندگان
چکیده
In this paper we present a system of interaction that gener-alises Lafont's interaction nets by allowing computation in several nets in parallel and communication through a state. This framework allows us to represent large classes of term rewriting systems, genuine parallel functions, non-determinism, communication, sharing, and hence can be used to code features from Standard ML and Concurrent ML.
منابع مشابه
Interaction Nets and Term-Rewriting Systems
Term rewriting systems provide a framework in which it is possible to specify and program in a traditional syntax (oriented equations). Interaction nets, on the other hand, provide a graphical syntax for the same purpose, but can be regarded as being closer to an implementation since the reduction process is local and asynchronous, and all the operations are made explicit, including discarding ...
متن کاملInteraction Nets and Term Rewriting Systems (Extended Abstract)
Term rewriting systems provide a framework in which it is possible to specify and program in a one-dimensional syntax. Interaction nets, on the other hand, provide a graphical syntax for the same purpose. In this paper, our aim is to bridge the gap between the above formalisms by showing how to understand interaction nets in a term rewriting framework. This allows us to transfer results from on...
متن کاملMulti-paradigm Logic Programming Integrating Paradigms via Interaction Nets (extended Abstract)
In this paper we begin a study of the integration of programming paradigms using Lafont's interaction nets as a unifying framework. Interaction nets are a very simple kind of rewrite system based on rewriting of networks. Because of their linear logic foundation they give a reened view of computation; they have been used for the implementation of programming languages based on the-calculus, and...
متن کاملA Calculus for Interaction Nets Based on the Linear Chemical Abstract Machine
Interaction nets are graph rewriting systems which are a generalisation of proof nets for classical linear logic. The linear chemical abstract machine (CHAM) is a term rewriting system which corresponds to classical linear logic, via the Curry-Howard isomorphism. We can obtain a textual calculus for interaction nets which is surprisingly similar to linear CHAM based on the multiplicative fragme...
متن کاملA study of two graph rewriting formalisms: Interaction Nets and MONSTR
Two superficially similar graph rewriting formalisms, Interaction Nets and MONSTR, are studied. Interaction Nets come from multiplicative Linear Logic and feature undirected graph edges, while MONSTR arose from the desire to implement generalized term graph rewriting efficiently on a distributed architecture and utilizes directed graph arcs. Both formalisms feature rules with small left-hand si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996